package WEEK_187;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

public class Test {

	public static void main(String[] args) {
		Solution solution = new Solution();
		/*
		 * List<List<String>> paths = new LinkedList<List<String>>(); List<String> list1
		 * = new LinkedList<String>(); list1.add("B");list1.add("C"); List<String> list2
		 * = new LinkedList<String>(); list2.add("D");list2.add("B"); List<String> list3
		 * = new LinkedList<String>(); list3.add("C");list3.add("A"); paths.add(list1);
		 * paths.add(list2); paths.add(list3);
		 * 
		 * String res=solution.destCity(paths); System.out.println(res);
		 */
		/*
		 * int[] nums = { 1, 0, 0, 1, 0, 1 };
		 * 
		 * boolean res = solution.kLengthApart(nums, 2); System.out.println(res);
		 */

		/*
		 * int[] nums = { 4, 2, 2, 2, 4, 4, 2, 2 }; int limit = 0; int res =
		 * solution.longestSubarray_SW(nums, limit); System.out.println(res);
		 */

		int[][] mat = { { 1, 3, 11 }, { 2, 4, 6 } };
		int res =solution.kthSmallest(mat, 5);
		System.out.println(res);

	}

}
